#include "AVLTree.hpp"

int main()
{
	const size_t N = 1020;
	vector<int> v;
	v.reserve(N);
	srand(time(0));
	for (size_t i = 0; i < N; ++i)
	{
		v.push_back(rand());
	}

	RBTree<int, int> t;
	for (auto e : v)
	{
		t.Insert(make_pair(e, e));
	}
	cout<<t.IsBalanceTree();
	t.Height();
    t.InOrder();
}